#define _CRT_SECURE_NO_WARNINGS 1
#include "Sort.h"

void SortTest()
{
	int data[] = { 9,8,7,6,5,4,3,2,1,0,-1,-2,-3,-4,-5,-6,-7,-8,-9 };
	int sz = sizeof(data) / sizeof(data[0]);
	InsertSort(data, sz);
	
	//ShellSort(data, sz);
	PrintArray(data, sz);
}

void SelectSortTest()
{
	int data[] = { 3,44,38,5,47,15,36,26,27,2,46,4,19,50,48 };
	int sz = sizeof(data) / sizeof(data[0]);
	SelectSort(data, sz);
	PrintArray(data, sz);
}

void HeapSortTest()
{
	int data[] = { 3,44,38,5,47,15,36,26,27,2,46,4,19,50,48 };
	int sz = sizeof(data) / sizeof(data[0]);
	HeapSort(data, sz);
	PrintArray(data, sz);
}

void BubbleSortTest()
{
	int data[] = { 3,44,38,5,47,15,36,26,27,2,46,4,19,50,48 };
	int sz = sizeof(data) / sizeof(data[0]);
	BubbleSort(data, sz);
	PrintArray(data, sz);
}

void TestOP()
{
	srand((unsigned int)time(0));
	const int N = 1000000;
	int* a1 = (int*)malloc(sizeof(int) * N);
	int* a2 = (int*)malloc(sizeof(int) * N);
	int* a3 = (int*)malloc(sizeof(int) * N);
	int* a4 = (int*)malloc(sizeof(int) * N);
	int* a5 = (int*)malloc(sizeof(int) * N);
	int* a6 = (int*)malloc(sizeof(int) * N);
	int* a7 = (int*)malloc(sizeof(int) * N);
	for (int i = 0; i < N; ++i)
	{
		a1[i] = rand();
		a2[i] = a1[i];
		a3[i] = a1[i];
		a4[i] = a1[i];
		a5[i] = a1[i];
		a6[i] = a1[i];
		a7[i] = a1[i];
	}

	int begin1 = clock();
	// InsertSort(a1, N);
	int end1 = clock();

	int begin2 = clock();
	ShellSort(a2, N);
	int end2 = clock();

	int begin3 = clock();
	// SelectSort(a3, N);
	int end3 = clock();

	int begin4 = clock();
	HeapSort(a4, N);
	int end4 = clock();

	int begin5 = clock();
	// QuickSort(a5, 0, N - 1);
	int end5 = clock();

	int begin6 = clock();
	// MergeSort(a6, N);
	int end6 = clock();

	int begin7 = clock();
	// BubbleSort(a7, N);
	int end7 = clock();

	printf("InsertSort:%d\n", end1 - begin1);
	printf("ShellSort:%d\n", end2 - begin2);
	printf("SelectSort:%d\n", end3 - begin3);
	printf("HeapSort:%d\n", end4 - begin4);
	printf("QuickSort:%d\n", end5 - begin5);
	printf("MergeSort:%d\n", end6 - begin6);
	printf("Bubble:%d\n", end7 - begin7);
	free(a1);
	free(a2);
	free(a3);
	free(a4);
	free(a5);
	free(a6);
	free(a7);
}



int main()
{
	// HeapSortTest();
	TestOP();

	// BubbleSortTest();
	return 0;
}